Schreier Spectrum of the Hanoi Towers Group on Three Pegs
نویسنده
چکیده
Finite dimensional representations of the Hanoi Towers group are used to calculate the spectra of the finite graphs associated to the Hanoi Towers Game on three pegs (the group serves as a renorm group for the game). These graphs are Schreier graphs of the action of the Hanoi Towers group on the levels of the rooted ternary tree. The spectrum of the limiting graph (Schreir graph of the action on the boundary of the tree) is also provided.
منابع مشابه
Twin Towers of Hanoi
In the Twin Towers of Hanoi version of the well known Towers of Hanoi Problem there are two coupled sets of pegs. In each move, one chooses a pair of pegs in one of the sets and performs the only possible legal transfer of a disk between the chosen pegs (the smallest disk from one of the pegs is moved to the other peg), but also, simultaneously, between the corresponding pair of pegs in the cou...
متن کاملIn How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved?
In this we paper we consider the version of the classical Towers of Hanoi games where the game-board contains more than three pegs. For k pegs we give a 2k 1/(k−2) lower bound on the number of steps necessary for transferring n disks from one peg to another. Apart from the value of the constants Ck this bound is tight.
متن کاملOn the Towers of Hanoi problem
We analyze a solution to a variant of the Towers of Hanoi problem, in which multiple spare pegs are used to move the disks from the source to the destination peg. We also discuss the interesting relation between the number of disks and the total number of disk moves when the number of spare pegs is a function of number of disks.
متن کاملA New Lower Bound for the Towers of Hanoi Problem
More than a century after its proposal, the Towers of Hanoi puzzle with 4 pegs was solved by Thierry Bousch in a breakthrough paper in 2014. The general problem with p pegs is still open, with the best lower bound on the minimum number of moves due to Chen and Shen. We use some of Bousch’s new ideas to obtain an asymptotic improvement on this bound for all p > 5.
متن کاملOn the Solution of the Towers of Hanoi Problem
In this paper, two versions of an iterative loopless algorithm for the classical towers of Hanoi problem with O(1) storage complexity and O(2) time complexity are presented. Based on this algorithm the number of different moves in each of pegs with its direction is formulated. Keywords—Loopless algorithm, Binary tree, Towers of Hanoi.
متن کامل